翻訳と辞書 |
Shrikhande graph : ウィキペディア英語版 | Shrikhande graph
In the mathematical field of graph theory, the Shrikhande graph is a named graph discovered by S. S. Shrikhande in 1959.〔.〕 It is a strongly regular graph with 16 vertices and 48 edges, with each vertex having degree 6. Every pair of nodes has exactly two other neighbors in common, whether the pair of nodes is connected or not. ==Construction== The Shrikhande graph can be constructed as a Cayley graph, where the vertex set is , and where two vertices are adjacent if and only if the difference is in .
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Shrikhande graph」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|